/* Copyright (c) 2008, The Visigoth Software Society
 * Copyright (c) 2006, Sun Microsystems Inc.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *     * Redistributions of source code must retain the above copyright notices,
 *       this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name Visigoth Software Society, FreeCC, Sun Microsystems, Inc. 
 *       nor the names of any contributors may be used to endorse or promote 
 *       products derived from this software without specific prior written 
 *       permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
 * THE POSSIBILITY OF SUCH DAMAGE.
 */

package org.visigoths.freecc.lexgen;

import java.util.*;

import org.visigoths.freecc.Grammar;



/**
 * Describes regular expressions which are sequences of
 * other regular expressions.
 */

public class RSequence extends RegularExpression {

  /**
   * The list of units in this regular expression sequence.  Each
   * Vector component will narrow to RegularExpression.
   */
  public List<RegularExpression> units = new ArrayList<RegularExpression>();

  Nfa GenerateNfa(LexicalState lexState, boolean ignoreCase)
  {
     if (units.size() == 1)
        return (units.get(0)).GenerateNfa(lexState, ignoreCase);

     Nfa retVal = new Nfa(lexState);
     NfaState startState = retVal.start;
     NfaState finalState = retVal.end;
     Nfa temp1;
     Nfa temp2 = null;

     RegularExpression curRE;

     curRE = units.get(0);
     temp1 = curRE.GenerateNfa(lexState, ignoreCase);
     startState.addMove(temp1.start);

     for (int i = 1; i < units.size(); i++)
     {
        curRE = units.get(i);

        temp2 = curRE.GenerateNfa(lexState, ignoreCase);
        temp1.end.addMove(temp2.start);
        temp1 = temp2;
     }

     temp2.end.addMove(finalState);

     return retVal;
  }

  public RSequence(Grammar grammar) {
    super(grammar);
  }

  public RSequence(List<RegularExpression> seq)
  {
     super(seq.get(0).grammar);
     setOrdinal(Integer.MAX_VALUE);
     units = seq;
  }
}
